A Brooks' Theorem for Triangle-Free Graphs
نویسنده
چکیده
Let G be a triangle-free graph with maximum degree ∆(G). We show that the chromatic number χ(G) is less than 67(1 + o(1))∆/ log∆.
منابع مشابه
A note on Brooks' theorem for triangle-free graphs
For the class of triangle-free graphs Brooks’ Theorem can be restated in terms of forbidden induced subgraphs, i.e. let G be a triangle-free and K1,r+1-free graph. Then G is r-colourable unless G is isomorphic to an odd cycle or a complete graph with at most two vertices. In this note we present an improvement of Brooks’ Theorem for triangle-free and rsunshade-free graphs. Here, an r-sunshade (...
متن کاملHomomorphisms of triangle-free graphs without a K5-minor
In the course of extending Grötzsch’s theorem, we prove that every triangle-free graph without a K5-minor is 3-colorable. It has been recently proved that every triangle-free planar graph admits a homomorphism to the Clebsch graph. We also extend this result to the class of triangle-free graphs without a K5-minor. This is related to some conjectures which generalize the Four-Color Theorem. Whil...
متن کاملComplete subgraphs of random graphs
A classical theorem by Erdős, Kleitman and Rothschild on the structure of triangle-free graphs states that with high probability such graphs are bipartite. Our first main result refines this theorem by investigating the structure of the ’few’ triangle-free graphs which are not bipartite. We prove that with high probability these graphs are bipartite up to a few vertices. Similar results hold if...
متن کاملBrooks type results for conflict-free colorings and {a, b}-factors in graphs
A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let f(r,∆) be the smallest integer k such that each r-uniform hypergraph of maximum vertex degree ∆ has a conflict-free coloring with at most k colors. As shown by Tardos and Pach, similarly to a classical Brooks’ type theorem for hypergraphs, f(r,∆) ≤...
متن کاملTriangle-free graphs that are signable without even holes
We characterize triangle-free graphs for which there exists a subset of edges that intersects every chordless cycle in an odd number of edges (TF odd-signable graphs). These graphs arise as building blocks of a decomposition theorem (for cap-free odd-signable graphs) obtained by the same authors. We give a polytime algorithm to test membership in this class. This algorithm is itself based on a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1106.1958 شماره
صفحات -
تاریخ انتشار 2011